| Hermelin - Hermelin [12rec.049] - Hermelin As 12rec. will celebrate it's fourth birthday this year, approximately four generations of musicians released their works with us. Hermelin, this wonderful Rock band from Hanover, Germany, came across your way as a 2nd wave 12rec. act. Remember their Split LP with Cologne Noiserockers Junique Fois Pi? It's the kids, hell yeah. In 2008, Hermelin show up with their full-length debut album. We're happy to support the band and bring forth their new album for free download and CD purchase... Keywords: Hermelin; 12rec; Postrock; Indierock; Rock; Guitar Downloads: 9,506 (3 reviews) |

| Hermelin - Hermelin
Downloads: 22 |

| Junique Fois Pi / Hermelin - Split [12rec.030] - Junique Fois Pi / Hermelin did you ever wonder what these kids are doing in their free time? you watch them talking to each other in the tube, realize their worn out shoes and shirts with names you never heard of, hair too long and dirty to suit any future mother-in-law. the one small group, four young lads from hanover in germany, call themselves after an elegant little beast of prey former kings made their coats from- hermelin (ermine)... Keywords: postrock; noiserock; instrumental; avantgarde; rock; indie; hermelin; junique fois pi; 12rec Downloads: 15,813 (2 reviews) |

| Split - Junique Fois Pi
Downloads: 27 |

| Mes souvenirs (Volume 1) - Jacob-Nicolas Moreau , Camille Hermelin Book digitized by Google from the library of the New York Public Library and uploaded to the Internet Archive by user tpb. Downloads: 243 | |

| Mes souvenirs (Volume 1; v. 1774-1797) - Jacob-Nicolas Moreau , Camille Hermelin Book digitized by Google from the library of the New York Public Library and uploaded to the Internet Archive by user tpb. Downloads: 198 | |

| Mes souvenirs (Volume 1) - Jacob Nicolas Moreau , Camille Hermelin Book digitized by Google from the library of University of Michigan and uploaded to the Internet Archive by user tpb. Downloads: 365 | |

| Minimum Vertex Cover in Rectangle Graphs - Reuven Bar-Yehuda We consider the Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families $\calR$ where $R_1 \setminus R_2$ is connected for every pair of rectangles $R_1,R_2 \in \calR$. This algorithm extends to intersection graphs of pseudo-disks. The second algorithm achieves a factor of $(1.5 + \varepsilon)$ in general rectangle families, for any fixed $\varepsilon > 0$, and w... Downloads: 9 | |

| BerĂ¤ttelse om Nordamerikas FĂ¶renta Stater, 1784 : bref till kanslipresidenten - Hermelin, Samuel Gustaf, Friherre, 1744-1820
Keywords: United States -- History Confederation, 1783-1789; United States -- Description and travel Downloads: 507 | |

| Mes souvenirs (Volume 2) - Moreau, Jacob Nicolas, 1717-1804
Downloads: 396 | |

| Mes souvenirs (Volume 1) - Moreau, Jacob Nicolas, 1717-1804
Downloads: 205 | |

| Binary Jumbled Pattern Matching on Trees and Tree-Like Structures - Travis Gagie Binary jumbled pattern matching asks to preprocess a binary string $S$ in order to answer queries $(i,j)$ which ask for a substring of $S$ that is of length $i$ and has exactly $j$ 1-bits. This problem naturally generalizes to vertex-labeled trees and graphs by replacing "substring" with "connected subgraph". In this paper, we give an $O(n^2 / \log^2 n)$-time solution for trees, matching the currently best bound for (the simpler problem of) strings... Downloads: 6 | |

| Hierarchies of Inefficient Kernelizability - Danny Hermelin The framework of Bodlaender et al. (ICALP 2008) and Fortnow and Santhanam (STOC 2008) allows us to exclude the existence of polynomial kernels for a range of problems under reasonable complexity-theoretical assumptions. However, there are also some issues that are not addressed by this framework, including the existence of Turing kernels such as the "kernelization" of Leaf Out Branching(k) into a disjunction over n instances of size poly(k)... Downloads: 7 | |

| Parameterized Two-Player Nash Equilibrium - Danny Hermelin We study the computation of Nash equilibria in a two-player normal form game from the perspective of parameterized complexity. Recent results proved hardness for a number of variants, when parameterized by the support size. We complement those results, by identifying three cases in which the problem becomes fixed-parameter tractable. These cases occur in the previously studied settings of sparse games and unbalanced games as well as in the newly considered case of locally bounded treewidth games... Downloads: 6 | |

| Domination When the Stars Are Out - Danny Hermelin We algorithmize the recent structural characterization for claw-free graphs by Chudnovsky and Seymour. Building on this result, we show that Dominating Set on claw-free graphs is (i) fixed-parameter tractable and (ii) even possesses a polynomial kernel. To complement these results, we establish that Dominating Set is not fixed-parameter tractable on the slightly larger class of graphs that exclude K1;4 as an induced subgraph... Downloads: 12 | |

| Unified Compression-Based Acceleration of Edit-Distance Computation - Danny Hermelin The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming solution for this problem computes the edit-distance between a pair of strings of total length O(N) in O(N^2) time. To this date, this quadratic upper-bound has never been substantially improved for general strings. However, there are known techniques for breaking this bound in case the strings are known to compress wel... Downloads: 7 | |

| A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression - Danny Hermelin We present a unified framework for accelerating edit-distance computation between two compressible strings using straight-line programs. For two strings of total length $N$ having straight-line program representations of total size $n$, we provide an algorithm running in $O(n^{1.4}N^{1.2})$ time for computing the edit-distance of these two strings under any rational scoring function, and an $O(n^{1.34}N^{1.34})$ time algorithm for arbitrary scoring functions... Downloads: 5 | |

| Mod/Resc Parsimony Inference - Igor Nor We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insect populations infected by inherited, intra-cellular parasitic bacteria. In this problem, that we denote by \textsc{Mod/Resc Parsimony Inference}, we are given a boolean matrix and the goal is to find two other boolean matrices with a minimum number of columns such that an appropriately defined operation on these matrices gives b... Downloads: 10 | |

| A few-electron quadruple quantum dot in a closed loop - Romain Thalineau We report the realization of a quadruple quantum dot device in a square-like configuration where a single electron can be transferred on a closed path free of other electrons. By studying the stability diagrams of this system, we demonstrate that we are able to reach the few-electron regime and to control the electronic population of each quantum dot with gate voltages. This allows us to control the transfer of a single electron on a closed path inside the quadruple dot system... Downloads: 6 | |